Erdős and Set Theory
نویسنده
چکیده
Paul Erdős (26 March 1913 20 September 1996) was a mathematician par excellence whose results and initiatives have had a large impact and made a strong imprint on the doing of and thinking about mathematics. A mathematician of alacrity, detail, and collaboration, Erdős in his six decades of work moved and thought quickly, entertained increasingly many parameters, and wrote over 1500 articles, the majority with others. His modus operandi was to drive mathematics through cycles of problem, proof, and conjecture, ceaselessly progressing and ever reaching, and his modus vivendi was to be itinerant in the world, stimulating and interacting about mathematics at every port and capital. Erdős’ main mathematical incentives were to count, to estimate, to bound, to interpolate, and to get at the extremal or delimiting, and his main emphases were on elementary and random methods. These had a broad reach across mathematics but was particularly synergistic with the fields that Erdős worked in and developed. His mainstays were formerly additive and multiplicative number theory and latterly combinatorics and graph theory, but he ranged across and brought in probability and ergodic theory, the constructive theory of functions and series, combinatorial geometry, and set theory. He had a principal role in establishing probabilistic number theory, extremal combinatorics, random graphs, and the partition calculus for infinite cardinals. Against this backdrop, this article provides an account of Erdős’ work and initiatives in set theory with stress put on their impact on the subject. Erdős importantly contributed to set theory as it became a broad, sophisticated field of mathematics in two dynamic ways. In the early years, he established results and pressed themes that would figure pivotally in formative advances. Later and throughout, he followed up on combinatorial initiatives that became part and parcel of set theory. Emergent from combinatorial thinking, Erdős’ results and initiatives in set theory had the feel of being simple and basic yet rich and pivotal, and so accrued into the subject as seminal at first, then formative, and finally central. Proceeding chronologically, we work to draw all this out as well as make connections with Erdős’ larger work and thinking, to bring out how it is all of a piece. Paul Erdős and His Mathematics, in two volumes [Halász et al., 2002a] and [Halász et al., 2002b], emanated from a 1999 celebratory conference, and it surveys Erdős’ work, provides reminiscences, and contains research articles. The Mathematics of Paul Erdős, in two volumes [Graham et al., 2013a] and
منابع مشابه
Some Problems and Ideas of Erdős in Analysis and Geometry
I review a meager few of the many problems and ideas Erdős proposed over the years involving a mixture of measure theory, geometry, and set theory.
متن کاملThe Erdős-Heilbronn Problem for Finite Groups
Additive Number Theory can be best described as the study of sums of sets of integers. A simple example is given two subsets A and B of a set of integers, what facts can we determine about A + B where A + B := {a + b | a ∈ A and b ∈ B}? We will state a result regarding this example shortly. We note that a very familiar problem in Number Theory, namely Lagrange’s theorem that every nonnegative i...
متن کاملAlmost all H-free graphs have the Erdős-Hajnal property
Erdős and Hajnal conjectured that, for every graph H, there exists a constant (H) > 0 such that every H-free graph G (that is, not containing H as an induced subgraph) must contain a clique or an independent set of size at least |G| . We prove that there exists (H) such that almost every H-free graph G has this property, meaning that, amongst the H-free graphs with n vertices, the proportion ha...
متن کاملAn algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
In this paper we give a proof that the largest set of perfect matchings, in which any two contain a common edge, is the set of all perfect matchings that contain a fixed edge. This is a version of the famous Erdős-Ko-Rado theorem for perfect matchings. The proof given in this paper is algebraic, we first determine the least eigenvalue of the perfect matching derangement graph and use properties...
متن کاملA Problem of Ramanujan, Erdős and Kátai on the Iterated Divisor Function
We determine asymptotically the maximal order of log d(d(n)), where d(n) is the number of positive divisors of n. This solves a problem first put forth by Ramanujan in 1915.
متن کاملErdős–szekeres Theorem with Forbidden Order Types. Ii
According to the Erdős-Szekeres theorem, every set of n points in the plane contains roughly logn in convex position. We investigate how this bound changes if our point set does not contain a subset that belongs to a fixed order type.
متن کامل